Stability (over time) of Modified-CS and LS-CS for Recursive Causal Sparse Reconstruction
نویسنده
چکیده
In this work, we obtain sufficient conditions for the “stability” of our recently proposed algorithms, modified-CS (for noisy measurements) and Least Squares CS-residual (LS-CS), designed for recursive reconstruction of sparse signal sequences from noisy measurements. By “stability” we mean that the number of misses from the current support estimate and the number of extras in it remain bounded by a time-invariant value at all times. The concept is meaningful only if the bound is small compared to the current signal support size. A direct corollary is that the reconstruction errors are also bounded by a time-invariant and small value.
منابع مشابه
Stability of LS-CS-residual and modified-CS for sparse signal sequence reconstruction
In this work, we show the “stability” of two of our recently proposed algorithms, LS-CS-residual (LS-CS) and the noisy version of modified-CS, designed for recursive reconstruction of sparse signal sequences from noisy measurements. By “stability” we mean that the number of misses from the current support estimate and the number of extras in it remain bounded by a time-invariant value at all ti...
متن کاملStability of Modified-CS and LS-CS for Recursive Reconstruction of Sparse Signal Sequences
In this work, we obtain sufficient conditions for the “stability” of our recently proposed algorithms, Least Squares Compressive Sensing residual (LS-CS) and modified-CS, for recursively reconstructing sparse signal sequences from noisy measurements. By “stability” we mean that the number of misses from the current support estimate and the number of extras in it remain bounded by a time-invaria...
متن کاملReProCS: A Missing Link between Recursive Robust PCA and Recursive Sparse Recovery in Large but Correlated Noise
This work studies the recursive robust principal components’ analysis (PCA) problem. Here, “robust” refers to robustness to both independent and correlated sparse outliers, although we focus on the latter. A key application where this problem occurs is in video surveillance where the goal is to separate a slowly changing background from moving foreground objects on-the-fly. The background seque...
متن کاملBlock-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients
Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...
متن کاملKF-CS: Compressive Sensing on Kalman Filtered Residual
We consider the problem of recursively reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear incoherent measurements with additive noise. The idea of our proposed solution, KF CS-residual (KFCS) is to replace compressed sensing (CS) on the observation by CS on the Kalman filtered (KF) observation residual computed using...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1006.4818 شماره
صفحات -
تاریخ انتشار 2010